Eecient Algorithms for Robustness in Matroid Optimization
نویسندگان
چکیده
The robustness function of a matroid measures the maximum increase in the weight of its minimum weight bases that can be produced by increases of a given total cost on the weights of its elements. We present an algorithm for computing this function, that runs in strongly polynomial time for matroids in which independence can be tested in strongly polynomial time. We identify key properties of transversal, scheduling and partition matroids, and exploit them to design robustness algorithms that are more eecient than our general algorithm.
منابع مشابه
A Thorough Comparative Analysis of PI and Sliding Mode Controllers in Permanent Magnet Synchronous Motor Drive Based on Optimization Algorithms
In this paper, the speed tracking for permanent magnet synchronous motor (PMSM) in field oriented control (FOC) method is investigated using linear proportional-integral (PI) controller, sliding mode controller (SMC) and its advanced counterparts. The advanced SMCs considered in this paper are fuzzy SMC (FSMC) and sliding mode controller with time-varying switching gain (SMC+TG) which can effec...
متن کاملOPTIMAL SIZE AND GEOMETRY DESIGN OF TRUSS STRUCTURES UTILIZING SEVEN META-HEURISTIC ALGORITHMS: A COMPARATIVE STUDY
Meta-heuristic algorithms are applied in optimization problems in a variety of fields, including engineering, economics, and computer science. In this paper, seven population-based meta-heuristic algorithms are employed for size and geometry optimization of truss structures. These algorithms consist of the Artificial Bee Colony algorithm, Cyclical Parthenogenesis Algorithm, Cuckoo Search algori...
متن کاملPERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کاملRobustness-based portfolio optimization under epistemic uncertainty
In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...
متن کاملRestricted Robust Optimization for Maximization over Uniform Matroid with Interval Data Uncertainty
For the problem of selecting p items with uncertain (interval) objective function coefficients so as to maximize total profit (maximization over uniform matroid) we introduce the r-restricted robust deviation criterion or the r-robust solution for short. We seek solutions that minimize the r-restricted robust deviation. This new criterion increases the modeling power of the robust deviation (mi...
متن کامل